Stack-sorting with consecutive-pattern-avoiding stacks
نویسندگان
چکیده
We introduce consecutive-pattern-avoiding stack-sorting maps SC?, which are natural generalizations of West's map s and analogues the classical-pattern-avoiding s? recently introduced by Cerbai, Claesson, Ferrari. characterize patterns ? such that Sort(SC?), set permutations sortable via s?SC?, is a permutation class, we enumerate sets Sort(SC?) for ??{123,132,321}. also study SC? from dynamical point view, characterizing periodic points all ??S3 computing max??Sn?|SC??1(?)| ??{132,213,231,312}. In addition, s132, show maximum number iterations s132 needed to send in Sn n?1. The paper ends with numerous open problems conjectures.
منابع مشابه
Stack Sorting, Trees, and Pattern Avoidance
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice through a stack (where the letters on the stack have to be in increasing order) was conjectured by West, and later proved by Zeilberger. Goulden and West found a...
متن کاملA spectral approach to consecutive pattern-avoiding permutations
We consider the problem of enumerating permutations in the symmetric group on n elements which avoid a given set of consecutive pattern S, and in particular computing asymptotics as n tends to infinity. We develop a general method which solves this enumeration problem using the spectral theory of integral operators on L([0, 1]m), where the patterns in S has length m + 1. Krĕın and Rutman’s gene...
متن کاملSorting with Complete Networks of Stacks
Knuth introduced the problem of sorting with a sequence of stacks. Tarjan extended this idea to sorting with acyclic networks of stacks (and queues), where items to be sorted move from a source through the network to a sink while they may be stored temporarily at nodes (the stacks). Both characterized which permutations are sortable; but complexity of sorting was not an issue. In contrast, give...
متن کاملStack-based sorting algorithms
The emergence of stacks as a hardware device in stack machines implies the recognition of the importance of using stacks in different computer applications and the need to make use of them in others. This paper uses stacks to solve the sorting problem. Two stack-based sorting algorithms are introduced. The first is based upon sorting by the insertion technique, whereas the second is based upon ...
متن کاملDirectional stack exchange along oriented oligothiophene stacks.
Directional growth of π-basic oligothiophene stacks on solid substrates is achieved by self-organizing, surface-initiated disulfide exchange polymerization. Successful addition of co-axial π-acidic stacks by templated hydrazone exchange provides general access to multicomponent architectures of unique complexity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2021
ISSN: ['1090-2074', '0196-8858']
DOI: https://doi.org/10.1016/j.aam.2021.102192